Climate and Bordeaux wine quality: identifying the key factors that differentiate vintages based on consensus rankings

The climate of Bordeaux, France, was examined to determine if climatic factors can distinguish between consensus vintage rankings, developed using eight ratings sources, of red and sweet white wines from 1961 to 2009. Climate variables were computed for the growing season and average plant phenological stages and were compared between the 10 highest and lowest ranked vintages. Good vintages exhibited higher heat accumulation during the growing season and a general lack of rainfall, particularly during veraison. Most climate factors were consistent for both red and sweet white wines. Mean maximum temperature during the growing season was an important discriminator between good and poor vintages for both reds and whites, although sweet white wines were also affected by growing season precipitation and temperatures during the vine's dormant period. In general, consensus vintage quality is consistent between reds and whites (Spearman's ρ?=?0.66, p?相似文献   

ORDERING FUZZY SETS BY CONSENSUS CONCEPT AND FUZZY RELATION EQUATIONS

A general class of consensus measures of fuzzy sets is introduced in this paper. It is shown that, while the consensus measures are valuations but neither isotone nor antitone with respect to the lattice structure induced by the pointwise maximum and minimum operations to the set of all the fuzzy sets on a nonempty crisp set, they are antitone valuations with respect to the lattice structure induced by the generalized sharpening relation to a quotient set of the set of fuzzy sets. It is also shown that the solutions of a finite fuzzy relation equation that have the maximum consensus measure can be characterized through the join operation of the latter lattice in terms of the maximum solution and some of the minimal solutions of the equation.     

Can the revolution be optimised? Oh yes it can! But,maybe not. Report on the one day symposium on “Varieties of Enactivism”

The “Varieties of Enactivism: A Conceptual Geography” 4th April 2014, was a one day symposium which took place at Goldsmith University, London. The symposium had the explicit aim of clarifying the status of enactive cognitive science both as a unified paradigm for cognitive science and in relation to the broader embodied cognition framework. In what follows I offer a brief summery of the various talks followed by some thoughts on the current state of play within enactivism.     

Output consensus for multiple non-holonomic systems under directed communication topology

In this paper, the problem of output consensus for multiple non-holonomic systems in chained form has been investigated. First, an output consensus controller under the strongly connected communication topology is devised by two steps, where a time-varying control strategy and the backstepping design technique are employed. Then, the results are extended to the general directed topology case via graph decomposition, in which the input-to-state stability theory plays a critical role. We prove that the proposed controller can achieve the semi-global output consensus among multiple non-holonomic systems, provided that the interaction graph contains a spanning tree. Finally, numerical examples are provided to illustrate the effectiveness of the designed controller.     

论音视频系统的专项设计与施工

本文通过分析音视频系统在技术、设计与施工方面的特点，认为在工程领域中，音视频系统的专项设计与施工是十分必要的，供相关设计和施工单位参考。     

Admissible output consensus control for singular swarm systems

For swarm systems consisting of agents described by high-order linear singular systems, admissible output consensus problems are investigated. By using observability decomposition and eigenvalue decomposition techniques, a sufficient condition for admissible output consensus and a necessary and sufficient condition for admissible limited control energy output consensus are obtained. Furthermore, it is shown that stabilisability of the agents is a sufficient condition for admissible output consensualisability, and an approach to solve the protocol design problem is presented. Finally, a numerical example is provided to demonstrate the effectiveness of protocol design approach.     

Graph-balancing algorithms for average consensus over directed networks

Consensus strategies find extensive applications in coordination of robot groups and decision-making of agents. Since balanced graph plays an important role in the average consensus problem and many other coordination problems for directed communication networks, this work explores the conditions and algorithms for the digraph balancing problem. Based on the analysis of graph cycles, we prove that a digraph can be balanced if and only if the null space of its incidence matrix contains positive vectors. Then, based on this result and the corresponding analysis, two weight balance algorithms have been proposed, and the conditions for obtaining a unique balanced solution and a set of analytical results on weight balance problems have been introduced. Then, we point out the relationship between the weight balance problem and the features of the corresponding underlying Markov chain. Finally, two numerical examples are presented to verify the proposed algorithms.     

A network dynamics approach to chemical reaction networks

A treatment of a chemical reaction network theory is given from the perspective of nonlinear network dynamics, in particular of consensus dynamics. By starting from the complex-balanced assumption, the reaction dynamics governed by mass action kinetics can be rewritten into a form which allows for a very simple derivation of a number of key results in the chemical reaction network theory, and which directly relates to the thermodynamics and port-Hamiltonian formulation of the system. Central in this formulation is the definition of a balanced Laplacian matrix on the graph of chemical complexes together with a resulting fundamental inequality. This immediately leads to the characterisation of the set of equilibria and their stability. Furthermore, the assumption of complex balancedness is revisited from the point of view of Kirchhoff's matrix tree theorem. Both the form of the dynamics and the deduced behaviour are very similar to consensus dynamics, and provide additional perspectives to the latter. Finally, using the classical idea of extending the graph of chemical complexes by a ‘zero’ complex, a complete steady-state stability analysis of mass action kinetics reaction networks with constant inflows and mass action kinetics outflows is given, and a unified framework is provided for structure-preserving model reduction of this important class of open reaction networks.     

均值模型下满足对数级收敛速度的动态系统

文章研究了在均值模型下,动态系统收敛至一致性状态所需的时间。在每一时间步内,节点计算其邻居的均值,并以计算结果作为自己的新值。我们考虑了当节点间的网络结构处于动态变化状态的情况。我们的分析证明了当节点的度在相邻时间点之间变化较小的情况下,即使仅满足微弱的连通性条件,动态变化的网络仍然可以保证动态系统会快速收敛到一致性状态。